41. Extension of Euclid I. 47 to n-Sided Regular Polygons

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Teaching Geometry According to Euclid, Volume 47, Number 4

460 NOTICES OF THE AMS VOLUME 47, NUMBER 4 I n the fall semester of 1988, I taught an undergraduate course on Euclidean and nonEuclidean geometry. I had previously taught courses in projective geometry and algebraic geometry, but this was my first time teaching Euclidean geometry and my first exposure to non-Euclidean geometry. I used the delightful book by Greenberg [8], which I believe my stu...

متن کامل

41-47 Bovy Feature

41 REASONS FOR DEMAND MANAGEMENT IN THE NETHERLANDS Despite the already overcrowded roads, especially in and around the Dutch conurbation, a further growth in the use of cars is expected in the near and farther future. Demographic and economic forces are the main factors for this development. There is widespread consensus, not only in The Netherlands, that building roads is not the right answer...

متن کامل

Complete eigenstates of N identical qubits arranged in regular polygons

We calculate the energy eigenvalues and eigenstates corresponding to coherent single and multiple excitations of an array of N identical qubits or two-level atoms (TLA’s) arranged on the vertices of a regular polygon. We assume only that the coupling occurs via an exchange interaction which depends on the separation between the qubits. We include the interactions between all pairs of qubits, an...

متن کامل

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions

We explore an instance of the question of partitioning a polygon into pieces, each of which is as “circular” as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of the smallest circumscribing circle to the largest inscribed disk. The problem is rich even for partitioning regular polygons into convex pieces, the focus of thi...

متن کامل

Protecting regular polygons

The minimum number of mutually non-overlapping congruent copies of a convex body K so that they can touch K and prevent any other congruent copy of K from touching K without overlapping each other is called the protecting number of K. In this paper we prove that the 1 2 Arnfried Kemnitz, LL aszll o Szabb o, Zoltt an Ujvv ary-Menyhh art protecting number of any regular polygon is three or four, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Mathematical Gazette

سال: 1897

ISSN: 0025-5572

DOI: 10.2307/3603592